On the Reducibility of Certain Quadrinomials
نویسندگان
چکیده
In 2007 West Coast Number Theory conference Walsh asked to determine all irreducible polynomials of the form P (x) = x + x + x + 4 with integer exponents i > j > k > 0, such that for some positive integer l the polynomial P (x) is reducible in Z[x]. In this paper we prove that such polynomials are quadrinomials x4m + x3m + x2m + 4, where m is an odd positive integer. In addition, Walsh asked for the examples of reducible quadrinomials x +x +x +n, n > 4 with no linear or quadratic factors. We compute the examples of reducible polynomials of the form above with non-trivial factors and negative coefficient n.
منابع مشابه
A Class of Quadrinomial Garsia Numbers
Real algebraic integers larger than 1 whose minimal polynomials are certain quadrinomials of degree at least 5 with constant term ±2 and all roots outside the closed unit disk are determined and some of their properties are mentioned.
متن کاملResultants and Discriminants of Chebyshev and Related Polynomials
We show that the resultants with respect to x of certain linear forms in Chebyshev polynomials with argument x are again linear forms in Chebyshev polynomials. Their coefficients and arguments are certain rational functions of the coefficients of the original forms. We apply this to establish several related results involving resultants and discriminants of polynomials, including certain self-r...
متن کاملBounds on Certain Higher-dimensional Exponential Sums via the Self-reducibility of the Weil Representation
We describe a new method to bound certain higher-dimensional exponential sums which are associated with tori in symplectic groups over finite fields. Our method is based on the self-reducibility property of the Weil representation. As a result, we obtain a sharp form of the Hecke quantum unique ergodicity theorem for generic linear symplectomorphisms of the 2Ndimensional torus.
متن کاملFinitary Reducibility on Equivalence Relations
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be Π n+2-complete under computable reducibility, we show that, for every n, there does exist a natural equivalence relation which...
متن کاملOn reducibility of weighted composition operators
In this paper, we study two types of the reducing subspaces for the weighted composition operator $W: frightarrow ucdot fcirc varphi$ on $L^2(Sigma)$. A necessary and sufficient condition is given for $W$ to possess the reducing subspaces of the form $L^2(Sigma_B)$ where $Bin Sigma_{sigma(u)}$. Moreover, we pose some necessary and some sufficient conditions under which the subspaces of the form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010